منابع مشابه
Continuation calculus
Programs with control are usually modeled using lambda calculus extended with control operators. Instead of modifying lambda calculus, we consider a different model of computation. We introduce continuation calculus, or CC, a deterministic model of computation that is evaluated using only head reduction, and argue that it is suitable for modeling programs with control. It is demonstrated how to...
متن کاملCompleteness of Continuation Models for lm-Calculus
We show that a certain simple call-by-name continuation semantics of Parigot’s λμ-calculus is complete. More precisely, for every λμ-theory we construct a cartesian closed category such that the ensuing continuation-style interpretation of λμ, which maps terms to functions sending abstract continuations to responses, is full and faithful. Thus, any λμ-category in the sense of L. Ong (1996, in “...
متن کاملA type system for Continuation Calculus
Continuation Calculus (CC), introduced by Geron and Geuvers [2], is a simple foundational model for functional computation. It is closely related to lambda calculus and term rewriting, but it has no variable binding and no pattern matching. It is Turing complete and evaluation is deterministic. Notions like “call-by-value” and “call-by-name” computation are available by choosing appropriate fun...
متن کاملContinuation Models Are Universal for -calculus
We show that a certain simple call-by-name continuation semantics of Parigot's-calculus is complete. More precisely, for every-theory we construct a cartesian closed category such that the ensuing continuation-style interpretation of , which maps terms to functions sending abstract continuations to responses , is full and faithful. Thus, any-category in the sense of is isomorphic to a continuat...
متن کاملContinuation semantics for the Lambek-Grishin calculus
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a structured configuration of formulas A1, . . . , An. The absence of structural context in the succedent makes the analysis of a number of phenomena in natural language semantics problematic. A case in point is scope constru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.127.5